Clustering of points randomly distributed in n-dimensional space.
نویسندگان
چکیده
We consider clusters formed by points randomly distributed in space, each point being connected to its nearest neighbor or to its nearest and next nearest neighbors. The size distribution of such clusters in n-dimensional space is presented.
منابع مشابه
High-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملApproximation and Streaming Algorithms for Projective Clustering via Random Projections
Let P be a set of n points in R. In the projective clustering problem, given k, q and norm ρ ∈ [1,∞], we have to compute a set F of k q-dimensional flats such that ( ∑ p∈P d(p,F)) is minimized; here d(p,F) represents the (Euclidean) distance of p to the closest flat in F . We let f k (P, ρ) denote the minimal value and interpret f k (P,∞) to be maxr∈P d(r,F). When ρ = 1, 2 and ∞ and q = 0, the ...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملA cultural algorithm for data clustering
Clustering is a widespread data analysis and data mining technique in many fields of study such as engineering, medicine, biology and the like. The aim of clustering is to collect data points. In this paper, a Cultural Algorithm (CA) is presented to optimize partition with N objects into K clusters. The CA is one of the effective methods for searching into the problem space in order to find a n...
متن کاملSupervised Feature Extraction of Face Images for Improvement of Recognition Accuracy
Dimensionality reduction methods transform or select a low dimensional feature space to efficiently represent the original high dimensional feature space of data. Feature reduction techniques are an important step in many pattern recognition problems in different fields especially in analyzing of high dimensional data. Hyperspectral images are acquired by remote sensors and human face images ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 63 2 Pt 2 شماره
صفحات -
تاریخ انتشار 2001